COMMENT ā VALID 00002 PAGES C REC PAGE DESCRIPTION C00001 00001 C00002 00002 A02 Randomness Theorems C00003 ENDMK Cā; A02 Randomness Theorems A04 Chaitin's Theory A05 Complexity of Polynomial Root-finding. A06 Let .. fixed one-to-one (``pairing'') function A07 Notes on NP-Completeness. A08 Algebraic numbers A09 The speedup theorem. [Fragmentary]